马钢二烧结配料计算机控制系统

阐明了马钢二烧结配科计算机控制系统的目的、控制形式、控制原理；根据烧结配料控制对象的特点对信号采样和控制算法进行了探讨；提供了系统的主要硬件结构，软件功能和程序框图。     

A Least Squares Approach to Escalator Algorithms for Adaptive Filtering

In this paper, we introduce an escalator (ESC) algorithm based on the least squares (LS) criterion. The proposed algorithm is relatively insensitive to the eigenvalue spread ratio (ESR) of an input signal and has a faster convergence speed than the conventional ESC algorithms. This algorithm exploits the fast adaptation ability of least squares methods and the orthogonalization property of the ESC structure. From the simulation results, the proposed algorithm shows superior convergence performance.     

差分跳频通信系统的特点及性能

文章介绍了一种新型的短波跳频通信技术——差分跳频,分析了差分跳频技术区别于常规跳频技术的主要特点。针对按序列检测的信号接收方法,对差分跳频通信系统在AWGN信道下的性能进行了理论分析,同时做出相应的计算机仿真,证实了差分跳频通信技术和按序列检测方法的结合,使通信系统在AWGN信道下的性能得到了比较显著的提升。     

基于进化算法的常减压装置模拟

提出了基于优选优生进化算法（Select—best and prepotency evolution algorithm，SPEA）的常减压装置模拟方法。以各塔的温度分布为目标，基于生产过程和分析数据，采用SPEA确定各塔板Murphree效率，从而精确描述各塔板平衡偏离程度。在实际应用中，获得具有良好精度的常减压装置模型。系统分析了SPEA算法的关键参数——优选领域大小与计算复杂性及寻优性能之间的关系，结果显示其取值为群体规模的10％最为合适。     

Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks

Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional (resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional (resp., unidirectional) topology is k-edge connected. The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18], which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19], which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity. In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity, and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for distributed implementation. A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless (Adhoc-Now 2003). Research performed in part while visiting the Max-Plank-Institut fur Informatik. Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms. Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990. His research interests include optical networks and wireless networks.     

个性化公开密钥系统的设计

论文提出利用用户提供的个性化信息来随机产生关联大素数,保证了素数选取的随机化、个性化,提高了RSA算法的安全性。     

Mechanical properties of polyethylene mixtures crystallized under high pressure

The mechanical properties of a medium molecular weight polyethylene (MMW‐PE) and an ultrahigh molecular weight PE (UHMW‐PE) binary mixture with different weight fractions crystallized from the melt at 0.1 and 450 MPa were studied. The tensile modulus, yield stress, and strain were obtained as a function of the weight fractions in the PE mixtures at 25 and 85°C. The tensile modulus in the sample crystallized at 0.1 MPa decreased from 1.5 GPa of pure MMW‐PE to about 0.4 GPa of pure UHMW‐PE with the UHMW‐PE content but it did not decrease with the UHMW‐PE in the sample crystallized at 450 MPa in testing at 25°C. A decreasing rate of the storage modulus E′ of UHMW‐PE in a dynamic measurement for the sample crystallized at 0.1 MPa with the temperature is larger than that of the sample crystallized at 450 MPa. These experimental facts are interpreted in relation to the molecular motion and crystallinity of the sample. © 2003 Wiley Periodicals, Inc. J Appl Polym Sci 87: 1962–1968, 2003     

带参数的一阶脉冲微分方程边值问题

利用上下解和单调迭代法。讨论了带参数的一阶脉冲微分方程。获得了单边Lipschitz条件下这类方程边值问题的解的存在性。     

新型实用布线算法──L─M算法

本文提出新型布线算法，集李氏迷宫法与线搜索法的长处为一体，以饱和带法进行动态排序，以线搜索法确定借孔位置，然后用李氏法进行单层布线，获得最佳路径，从而达到线型好，布通率高的效果。     

一种自动布线方法：多级线探索法

本文介绍了一种在微机上实现的印制板自动布线方法──多级线探索法及其编程方法。这种方法是基于完备布线算法的概念，通过分析李氏算法和传统线探索法的不足之处而得到的。虽然它也是一种线探索法，但有较传统线探索法更强的探索能力，不需要结合李氏算法而能单独完成布线任务，是一种较理想的算法，通过实验获得了较为满意的效果。